DDD distribution in Erlang

Decision diagrams are structures used in several domains where memory usage is critical. Data Decision Diagrams (DDD) are a kind of decision diagrams used in model-checking for example. However, they bring a solution to the memory problem that is not always sufficient. To overcome memory limit, a solution is to distribute memory. Some implementations exist for BDD (Binary Decision Diagrams), but are neither really efficient nor maintened. In this report, new distribution algorithms for decision diagrams are presented, based on DDD properties. An implementation in Erlang of a distributed DDD package is explained; then some results about distribution are given and discussed, based on this implementation.